Probabilistic Counting with Randomized Storage
نویسندگان
چکیده
Previous work by Talbot and Osborne [2007] explored the use of randomized storage mechanisms in language modeling. These structures trade a small amount of error for significant space savings, enabling the use of larger language models on relatively modest hardware. Going beyond space efficient count storage, here we present the Talbot Osborne Morris Bloom (TOMB) Counter, an extended model for performing space efficient counting over streams of finite length. Theoretical and experimental results are given, showing the promise of approximate counting over large vocabularies in the context of limited space.
منابع مشابه
Probabilistic Counting as an Extension to Randomized Count Storage
Previous work by Talbot and Osborne (2007a) explored the use of randomized storage mechanisms in language modeling. These structures trade a small amount of error for significant space savings, enabling the use of larger language models on relatively modest hardware. Going beyond space efficient count storage, here we present the Transition Counter, an extended model for performing space effici...
متن کاملSilverback: Scalable Association Mining For Massive Temporal Data in Columnar Probabilistic Databases
We investigate large scale probabilistic association mining on modest hardware infrastructure. We first propose a probabilistic columnar infrastructure for storing the transaction database. Using Bloom filters and reservoir sampling techniques, the storage is e cient and probabilistic. Then we propose an accurate probabilistic algorithm for mining frequent item-sets. Our algorithm relies on the...
متن کاملOn Hashing-Based Approaches to Approximate DNF-Counting
Propositional model counting is a fundamental problem in artificial intelligence with a wide variety of applications, such as probabilistic inference, decision making under uncertainty, and probabilistic databases. Consequently, the problem is of theoretical as well as practical interest. When the constraints are expressed as DNF formulas, Monte Carlo-based techniques have been shown to provide...
متن کاملRandomness and Counting 6.1 Probabilistic Polynomial-time Construction 6.4 (the Reduction): on Input a Natural Number N > 2 Do
I owe this almost atrocious variety to an institution which other republics do not know or which operates in them in an imperfect and secret manner: the lottery. So far, our approach to computing devices was somewhat conservative: we thought of them as executing a deterministic rule. A more liberal and quite realistic approach , which is pursued in this chapter, considers computing devices that...
متن کاملAlgorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls
Probabilistic inference via model counting has emerged as a scalable technique with strong formal guarantees, thanks to recent advances in hashing-based approximate counting. State-of-theart hashing-based counting algorithms use an NP oracle (SAT solver in practice), such that the number of oracle invocations grows linearly in the number of variables n in the input constraint. We present a new ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009